J. Symbolic Computation, 235–265 The Magma Algebra System I: The User Language† WIEB BOSMA‡, JOHN CANNON§ AND CATHERINE PLAYOUST¶ Computational Algebra Group, School of Mathematics and Statistics, The

Source URL: www.math.ru.nl

• Algebra
• Mathematics
• Abstract algebra
• Universal algebra
• Mathematical structures
• Mathematical logic
• Algebraic structures
• Magma
• Sigma-algebra
• Structure
• F-algebra
• Model theory

3 Scientific Information 3.1

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Analysis of algorithms
• Online algorithms
• Computer science
• Theory of computation
• Competitive analysis
• List update problem
• Adversary model
• Algorithm
• Randomized algorithm
• Travelling salesman problem
• Time complexity

Using a Visual Routine to Model the Computation of Positional Relationships Andrew Lovett () Kenneth Forbus () Qualitative Reasoning Group Electrical Engineering and C

Source URL: vvv.spatiallearning.org

Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity ∗ Rahul Jain† Hartmut Klauck‡ Miklos Santha§ Abstract A Direct Sum Theorem holds in a model of computation, when for every probl

Source URL: www.liafa.univ-paris-diderot.fr

Presenter and Main Author Co-Authors, if any Title

Source URL: www.strc.ch

• Multi-agent systems
• Complex systems theory
• Models of computation
• Systems science
• Traffic simulation
• Scientific modeling
• Computing
• Agent-based model
• MATSim
• Kay
• Simulation
• Transport network

Conservative Logic1 Edward Fredkin and Tommaso Toffoli MIT Laboratory for Computer Science 545 Technology Square Cambridge, MassachusettsConservative logic is a comprehensive model of computation which explicitly

Source URL: strangepaths.com

Effects of Relevant and Irrelevant Primes on Idea Generation: A Computation Model

Source URL: www.ece.uc.edu

PDF Document

Source URL: ncgia.ucsb.edu

• Complex systems theory
• Simulation
• Metaphysics
• Systems science
• Academia
• Scientific modeling
• Multi-agent systems
• Models of computation
• Agent-based model
• Emergence
• Intelligent agent
• Scientific modelling

Recursive Session Types Revisited Ornela Dardha∗ School of Computing Science, University of Glasgow, UK Session types model structured communication-based programming. In particular, binary

Source URL: www.dcs.gla.ac.uk

• Computability theory
• Process calculi
• Π-calculus
• Theory of computation
• Function
• Valuation
• Logarithm
• Μ operator
• Primitive recursive function
• Mathematics
• Theoretical computer science
• Functions and mappings

BRICS Basic Research in Computer Science BRICS RSM¨oller et al.: Predicate Abstraction for Dense Real-Time Systems Predicate Abstraction for

Source URL: www.brics.dk

• Applied mathematics
• Models of computation
• Model checking
• Fixed-point combinator
• Abstraction
• Predicate
• Abstract interpretation
• Finite-state machine
• Function
• Theoretical computer science
• Mathematics
• Lambda calculus